Sylow subgraphs in self-complementary vertex transitive graphs
نویسندگان
چکیده
منابع مشابه
On Sylow Subgraphs of Vertex-transitive Self-complementary Graphs
One of the basic facts of group theory is that each finite group contains a Sylow p-subgroup for each prime p which divides the order of the group. In this note we show that each vertex-transitive selfcomplementary graph has an analogous property. As a consequence of this fact, we obtain that each prime divisor p of the order of a vertex-transitive self-complementary graph satisfies the congrue...
متن کاملSelf-Complementary Vertex-Transitive Graphs
A graph Γ is self-complementary if its complement is isomorphic to the graph itself. An isomorphism that maps Γ to its complement Γ is called a complementing isomorphism. The majority of this dissertation is intended to present my research results on the study of self-complementary vertex-transitive graphs. I will provide an introductory mini-course for the backgrounds, and then discuss four pr...
متن کاملOn finite graphs that are self-complementary and vertex transitive
Self-complementary graphs have been extensively investigated and effectively used in the study of Ramsey numbers. It is well-known and easily proved that there exist regular self-complementary graphs of order n if and only if n == 1 (mod 4). So it is natural to ask whether a similar result for self-complementary vertex-transitive graphs exists. More precisely, for which positive integers n do t...
متن کاملVertex-transitive self-complementary uniform hypergraphs
In this paper we examine the orders of vertex-transitive self-complementary uniform hypergraphs. In particular, we prove that if there exists a vertex-transitive selfcomplementary k-uniform hypergraph of order n, where k = 2 or k = 2 + 1 and n ≡ 1 (mod 2), then the highest power of any prime dividing n must be congruent to 1 modulo 2. We show that this necessary condition is also sufficient in ...
متن کاملTransitive tournaments and self-complementary graphs
A simple proof is given for a result of Sali and Simonyi on selfcomplementary graphs. ß 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111±112, 2001 Keywords: self-complementary graphs; transitive tournaments Motivated by Sperner capacities of digraphs, A. Sali and G. Simonyi [1] discovered an interesting property of self-complementary graphs. Here a proof of their result is given which is con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expositiones Mathematicae
سال: 2006
ISSN: 0723-0869
DOI: 10.1016/j.exmath.2005.09.003